THE TRAVELLING SALESMAN PROBLEM IN THE ENGINEERING EDUCATION PROGRAMMING CURRICULUM
نویسندگان
چکیده
منابع مشابه
New Integer Programming Formulations of the Generalized Travelling Salesman Problem
The Generalized Travelling Salesman Problem, denoted by GTSP, is a variant of the classical travelling salesman problem (TSP), in which the nodes of an undirected graph are partitioned into node sets (clusters) and the salesman has to visit exactly one node from every cluster. In this paper we described six distinct formulations of the GTSP as an integer programming. Apart from the standard for...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملAnt colonies for the travelling salesman problem.
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to b...
متن کاملThe Limit in the Mean Field Bipartite Travelling Salesman Problem
The edges of the complete bipartite graph Kn,n are assigned independent lengths from uniform distribution on the interval [0, 1]. Let Ln be the length of the minimum travelling salesman tour. We prove that as n tends to infinity, Ln converges in probability to a certain number, approximately 4.0831. This number is characterized as the area of the region x, y ≥ 0, (1 + x/2) · e + (1 + y/2) · e ≥...
متن کاملThe travelling salesman problem in the stochastic mean field model
In the stochastic mean field model of distance, the edges of the complete graph on n vertices are assigned independent identically distributed random lengths. We take these lengths from uniform distribution on the interval [0, 1] and let Ln denote the minimum length of a travelling salesman tour. It has been conjectured since the mid-1980’s that Ln converges in probability to a certain number, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Aviation University
سال: 2017
ISSN: 2306-1472,1813-1166
DOI: 10.18372/2306-1472.72.11989